The super connectivity of shuffle-cubes

نویسندگان

  • Jun-Ming Xu
  • Min Xu
  • Qiang Zhu
چکیده

The shuffle-cube SQn, where n ≡ 2 (mod 4), a new variation of hypercubes proposed by Li et al. [T.-K. Li, J.J.M. Tan, L.-H. Hsu, T.-Y. Sung, The shuffle-cubes and their generalization, Inform. Process. Lett. 77 (2001) 35–41], is an n-regular n-connected graph. This paper determines that the super connectivity of SQn is 2n − 4 and the super edge-connectivity is 2n− 2 for n 6.  2005 Elsevier B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fault Hamiltonicity of the Shuffle - Cubes ∗

Hypercubes are famous interconnection networks. The shuffle cubes are proposed as its variation with lower diameter. In this paper, we concentrate on the fault tolerant hamiltonicity and hamiltonian connectivity of the shuffle cube. We say that a graph G is f-hamiltonian if there is a hamiltonian cycle in G − F and is f-hamiltonian connected if there is a hamiltonian path between any two vertic...

متن کامل

Super-connectivity and super-edge-connectivity for some interconnection networks

Let G 1⁄4 ðV ;EÞ be a k-regular graph with connectivity j and edge connectivity k. G is maximum connected if j 1⁄4 k, and G is maximum edge connected if k 1⁄4 k. Moreover, G is super-connected if it is a complete graph, or it is maximum connected and every minimum vertex cut is fxjðv; xÞ 2 Eg for some vertex v 2 V ; and G is super-edge-connected if it is maximum edge connected and every minimum...

متن کامل

Restricted connectivity for three families of interconnection networks

Vertex connectivity and edge connectivity are two important parameters in interconnection networks. Even though they reflect the fault tolerance correctly, they undervalue the resilience of large networks. By the concept of conditional connectivity and super-connectivity, the concept of restricted vertex connectivity and restricted edge connectivity of graphs was proposed by Esfahanian [A.H. Es...

متن کامل

Fault-tolerant analysis of a class of networks

In this paper, we explore the 2-extraconnectivity of a special class of graphs G(G0,G1;M) proposed by Chen et al. [Y.-C. Chen, J.J.M. Tan, L.-H. Hsu, S.-S. Kao, Super-connectivity and super edge-connectivity for some interconnection networks, Applied Mathematics and Computation 140 (2003) 245–254]. As applications of the results, we obtain that the 2-extraconnectivities of several well-known in...

متن کامل

Edge fault tolerance analysis of a class of interconnection networks

Fault tolerant measures have played an important role in the reliability of an interconnection network. Edge connectivity, restricted-edge-connectivity, extra-edge-connectivity and super-edge-connectivity of many well-known interconnection networks have been explored. In this paper, we study the 2-extra-edge connectivity of a special class of graphs G(G0,G1; M) proposed by Chen et al. [Appl. Ma...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Inf. Process. Lett.

دوره 96  شماره 

صفحات  -

تاریخ انتشار 2005